Unification Categorial Grammar: a concise, extenable grammar for natural language processing

نویسندگان

  • Jonathan Calder
  • Ewan Klein
  • Henk Zeevat
چکیده

Abst_~'act ~hrlication Categorial Gtmmnar (t/:G) combines the syntactic iu.,;ights of Categoria[ Grammar with the semantic insights of I)i;course Representation Theory. The addition of uni/ication to these two frameworks allows a simple account of intexaction be,.wcen different linguistic levels within a constraining , monostraml theory. The resulting, computationaUy efticient, system provides an explicit formal framework for linguistic description, widfin which large fi'agments of grammms for French aud English have ah'eady been developed. We present the for-mai basis of UCG, with i.dependent definitions of well-. toxmedness fol syntactic and semantic dimensions. We will also focus on the concept of #nodifier within the theory. Uniiieation C~tcgo~q_al Grammm' (UCG) comlfines the syntactic insights of C~tegori~ll Grammar with the semantic insights of Discourse Rep,:escntafion Theory (DRT, Kamp 1981). The addition of unilicalion (Shiebcr et al. 1983) to these two flameworks allows a simple account of intcractiou between different linguistic levels. The xesulting, computationally efficient, system provkles an explicit tbmml fi'amework fbr linguistic description, within which large grammar ti'agnrents lbr French (Baschung et al. 1987) and F.nglish (Calder, Moens and Jmevat 1986) have already been developed. This paper will describe the design of the UCG formalism, illustrated by exarnples of grammatical categories and rules, l UCG embodies seve.d recent trends in linguistics. First, being a categorial grar,amar, it is strongly lexicalist, In other words relatively little Jr, formation is contained in grammar rules. Most information odginates in the lexicon. Second, it is strictly dechtrative. Unitication is the only operation allowed over grammatical objects;. Third, there is a very close relationship between the syntax and semantics of linguistic expressions. UCG lies with:ht the family of grammars described by Uszkoreit 1986 and Kmttunen 1986. tJCG also has close affinities to the IIead-Driven Phrase Structure Grammar (I-IPSG) proposed by Pollard 1985. The main theoretical difference is that in IIPSG welMi~rmedrmss is characterized algorithmically, rather than declm'atively as in OC(/. For this reason, we t,ave adopted l'ollard's tenn;nology and refer to linguistic expressions as signs. A sign retm>;ents a complex of phonological, syntactic and semantic tale.nation, each of these linguistic levels having its own definitions of well-formedness, In U(.'G, we employ three primitive categories: nomts (tmun), sentences (sent) md noun phrases (ltp) These primitive categories i 'IIm work described here is SUl)portexl by the EEC ESPRIT projec P393 ACORD: the Cons|ruction and Interrogation of Knowledge Bases asia Natural L~mguag(~ Text and Graphics. admit further specification by features, so that we …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Role of Syntax in Vector Space Models of Compositional Semantics

Modelling the compositional process by which the meaning of an utterance arises from the meaning of its parts is a fundamental task of Natural Language Processing. In this paper we draw upon recent advances in the learning of vector space representations of sentential semantics and the transparent interface between syntax and semantics provided by Combinatory Categorial Grammar to introduce Com...

متن کامل

Prediction in Chart Parsing Algorithms for Categorial Unification Grammar

Natural language systems based on Categorial Unification Grammar (CUG) have mainly employed bottomup parsing algorithms for processing. Conventional prediction techniques to improve the efficiency of the • parsing process, appear to fall short when parsing CUG. Nevertheless, prediction seems necessary when parsing grammars with highly ambiguous lexicons or with noncanonical categorial rules. In...

متن کامل

A Parser for Portable NL Interfaces Using Graph-Unification-Based Grammars

This paper presents the reasoning behind the selection and design of a parser for the Lingo project on natural language interfaces at MCC. The major factors in the selection of the parsing algorithm were the choices of having a syntactically based grammar, using a graph-unification-based representation language, using Combinatory Categorial Grammars, and adopting a one-to-many mapping from synt...

متن کامل

A flexible by Gosse Bouma Esther

A graph-unification-based representation language is described that was developed as the grammar formalism for the LILOG research project at IBM Germany. The Stuttgart Unification Formalism (STUF) differs from its predecessors in its higher flexibility and its algebraic structure. It is well suited for the implementation of rather different linguistic approaches, but is currently employed mainl...

متن کامل

Learning to Map Chinese Sentences to Logical Forms

This paper addresses the problem of learning to map Chinese sentences to logical forms. The training data consist of Chinese natural language sentences paired with logical representations of their meaning. Although many approaches have been developed for learning to map from some western natural languages to two different meaning representations, there is no such approached for Chinese language...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988